Recently, Distributed Constraint optimization Problems (DCOP) have been drawing a growing body of attention as an important research area in multi agent systems as a large body of real problems can be modeled by them. The primary goal of this research is to design a Distributed and effective algorithm to solve DCOP. There are various criteria that measure the efficiency of DCOP algorithms, but the most efficient algorithm for DCOP is the one by which the computation and communication cost is as low as possible and the quality of the solution is high. In this paper, we focus on an approximate DCOP algorithm called DALO (Distributed Asynchronous Local optimization). Using the main idea of the DALO algorithm, we propose a new algorithm to solve DCOP, which exhibits two important improvements over the DALO algorithm. First we use a sequential partial approach to select a coefficient of leaders to compute the best assignment for agents by which the computation and communication cost decrease in the whole DCOP. The second improvement is an evolutionary approach by which the computation and communication burden for each agent decreases. We present some empirical evidences that show our algorithm performs better than the DALO algorithm.

This paper investigates a novel method to solve Distributed optimization problems in the presence of communication delays between the networked agents that cooperate together to find an optimal solution of a global cost function composed of local ones. In the problem of Distributed optimization in a network of multi-agent because of existing phenomena such as communication delay, deriving approaches having appropriate performance so that the states of all agents converge to the same value always has been a substantial challenge. Delay-dependent conditions in the form of linear matrix inequities are derived to analyze the convergence of the introduced scheme to the optimal solution. It is demonstrated that the maximum allowable time delay in the network and convergence rate of the optimization procedure are increased by the suggested strategy. Finally, comparative simulation results are considered to illustrate the superior performance of the introduced scheme compared to a rival one in the literature.

Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this algorithm is to distribute the heavy traffic of data and equal load of highly-consumed energy throughout the networks by introducing unequal and unbalanced clusters into the network. In the second stage, the light sensor mechanism which is called active node sensor algorithm has been proposed. The major purpose of this mechanism is to prevent excessive interfering data of sensors through incorporating a set of active nodes in each cluster with a defensive shield near to the incident node. The third stage has aimed at proposing an active node algorithm for complexity of internal and external addressing due to clusters routing in high density distribution based on the values within node range. The obtained results indicate relative success of the design in terms of energy optimization on the basis of routing protocol.